@Article{MauriLore:2012:CoGeAp,
author = "Mauri, Geraldo Regis and Lorena, Luiz Antonio Nogueira",
affiliation = "Center for Agrarian Sciences, Federal University of
Esp{\'{\i}}rito Santo – UFES and {Instituto Nacional de
Pesquisas Espaciais (INPE)}",
title = "A column generation approach for the unconstrained binary
quadratic programming problem",
journal = "European Journal of Operational Research",
year = "2012",
volume = "217",
number = "1",
pages = "69--74",
month = "Feb",
keywords = "column generation, Unconstrained binary quadratic programming,
lagrangean relaxation with clusters.",
abstract = "This paper proposes a column generation approach based on the
Lagrangean relaxation with clusters to solve the unconstrained
binary quadratic programming problem that consists of maximizing a
quadratic objective function by the choice of suitable values for
binary decision variables. The proposed method treats a mixed
binary linear model for the quadratic problem with constraints
represented by a graph. This graph is partitioned in clusters of
vertices forming sub-problems whose solutions use the dual
variables obtained by a coordinator problem. The column generation
process presents alternative ways to \find upper and lower
bounds for the quadratic problem. Computational experiments were
performed using hard instances and the proposed method was
compared against other methods presenting improved results for
most of these instances.",
doi = "10.1016/j.ejor.2011.09.016",
url = "http://dx.doi.org/10.1016/j.ejor.2011.09.016",
issn = "0377-2217",
label = "lattes: 7195702087655314 2 MauriLore:2011:CoGeAp",
language = "en",
targetfile = "Mauri-EurJOpRes-v217-n1-p69-74-science[2].pdf",
urlaccessdate = "06 maio 2024"
}